Study on Delaunay Triangulation with the Islets Constraints
نویسندگان
چکیده
Aiming at Delaunay triangulation with islets constrains in terrain simulation. A general Delaunay triangulation algorithm for constrained data set with islets is proposed. The algorithm firstly constructs Constrained Delaunay Triangulation with constraint polygons which are inner boundary of islets, then according to topological relations within edge, surface, arc segment, applies bidirectional search to find the triangle in islet, lastly it carries on certain corresponding processing to complete the Delaunay triangulation algorithm with islets. The analyses show the algorithm simple, fast speed. The algorithm can be used in 3-D terrain vision.
منابع مشابه
Towards a Definition of Higher Order Constrained Delaunay Triangulations
When a triangulation of a set of points and edges is required, the constrained Delaunay triangulation is often the preferred choice because of its well-shaped triangles. However, in applications like terrain modeling, it is sometimes necessary to have flexibility to optimize some other aspect of the triangulation, while still having nicely-shaped triangles and including a set of constraints. Hi...
متن کاملMinimal Set of Constraints for 2D Constrained Delaunay Reconstruction
Given a triangulation T of n points in the plane, we are interested in the minimal set of edges in T such that T can be reconstructed from this set (and the vertices of T ) using constrained Delaunay triangulation. We show that this minimal set consists of the non locally Delaunay edges of T , and that its cardinality is less than or equal to n+ i=2 (if i is the number of interior points in T )...
متن کاملA25 Delaunay Triangulation-based Spatially Constrained Inversion for Quasi 3d Modeling of Airborne Tem Data
SUMMARY The spatially constrained inversion (SCI) is a robust methodology for quasi-3D modeling of geoelectrical and EM data of varying spatial density, using a 1D forward solution. Information migrate horizontally through spatial constraints applied between nearest neighboring soundings, and allow resolution of layers that would be locally poorly resolved. The constraints are built using the D...
متن کاملDomain Triangulation Between Convex Polytopes
In this paper, we propose a method for solving the problem triangulation of a domain between convex polyhedrons in ddimensional space using Delaunay triangulation in O(N) time. Novelty of our work is in using a modified Delaunay triangulation algorithm with constraints.
متن کاملFully Dynamic Constrained Delaunay Triangulations
We present algorithms for the efficient insertion and removal of constraints in Delaunay Triangulations. Constraints are considered to be points or any kind of polygonal lines. Degenerations such as edge overlapping, self-intersections or duplicated points are allowed and are automatically detected and fixed on line. As a result, a fully Dynamic Constrained Delaunay Triangulation is achieved, a...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Intelligent Information Management
دوره 2 شماره
صفحات -
تاریخ انتشار 2010